Optimal Rate Code Constructions for Computationally Simple Channels
نویسندگان
چکیده
منابع مشابه
Optimal Subsystem Code Constructions
In this paper, a generic method to derive subsystem codes from existing subsystem codes is given that allows one to trade the dimensions of subsystem and co-subsystem while maintaining or improving the minimum distance. As a consequence, it is shown that all pure MDS subsystem codes are derived from MDS stabilizer codes. Furthermore, a simple construction of pure MDS subsystem codes is obtained...
متن کاملExplicit List-Decodable Codes with Optimal Rate for Computationally Bounded Channels
A stochastic code is a pair of encoding and decoding procedures (Enc;Dec) where Enc : f0; 1g f0; 1g ! f0; 1g, and a message m 2 f0; 1g is encoded by Enc(m;S) where S f0; 1g is chosen uniformly by the encoder. The code is (p; L)-list-decodable against a class C of \channel functions" C : f0; 1g ! f0; 1g if for every message m 2 f0; 1g, and every channel C 2 C that induces at most pn errors, appl...
متن کاملNear-capacity fixed-rate and rateless channel code constructions
Near-Capacity Fixed-Rate and Rateless Channel Code Constructions
متن کاملCategorical Code Constructions
We study categories of codes and precodes. The objects in these categories capture the encoding and decoding process of error control codes, source codes, or cryptographic codes. We show that these categories are complete and cocomplete. This gives a wealth of new code constructions.
متن کاملSimple Low-Rate Non-Binary LDPC Coding for Relay Channels
Binary LDPC coded relay systems have been well studied previously with the assumption of infinite codeword length. In this paper, we deal with non-binary LDPC codes which can outperform their binary counterpart especially for practical codeword length. We utilize non-binary LDPC codes and recently invented non-binary coding techniques known as multiplicative repetition to design the low-rate co...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of the ACM
سال: 2016
ISSN: 0004-5411,1557-735X
DOI: 10.1145/2936015